随着大数据时代的出现以及人工智能和其他技术的发展，数据安全和隐私保护变得越来越重要。推荐系统在我们的社会中有许多应用程序，但是建议系统的模型构建通常与用户数据密不可分。特别是对于基于深度学习的推荐系统，由于模型的复杂性和深度学习本身的特征，其培训过程不仅需要长时间的培训时间和丰富的计算资源，而且还需要使用大量的用户数据，在数据安全和隐私保护方面构成了巨大的挑战。如何在确保数据安全性的同时训练分布式建议系统已成为要解决的紧迫问题。在本文中，我们基于Intel SGX（软件保护扩展），可信赖的执行环境的实施以及TensorFlow框架，实施两个方案，水平联合学习和安全的分布式培训，以实现安全，分布式分布式建议的基于系统的学习方案在不同的情况下。我们在经典的深度学习推荐模型（DLRM）上进行实验，该模型是一种基于神经网络的机器学习模型，旨在个性化和建议，结果表明，我们的实施介绍了模型性能的大约没有损失。训练速度在可接受的范围内。

及时调整是将预训练的语言模型调整为下游任务的一种新兴方法。但是，现有的研究主要是为输入序列增加提示。由于中间多头自我注意和馈送网络计算，因此这种方式无法正常工作，从而使模型优化不是很好。因此，我们提出了一种称为“图层调整”的新颖调整方式，旨在在变压器层中添加可学习的参数。具体而言，我们专注于变压器中的馈电网络的图层调整，即FLANing。它将其他单元引入每个馈送网络的隐藏层。我们对公共线索基准进行了广泛的实验。结果表明：1）在几乎所有情况下，我们的FL-tuning tospormports促进了全数据和少量设置下的调整方法。特别是，它在WSC 1.0上的准确性提高了17.93％（全数据设置），而F1上的精度则提高了P-Tuning V2上的Cluener上的精度（几乎没有射击设置）。 2）我们的FL-调整更稳定，收敛速度比P-Tuning V2快约1.17倍。 3）只有大约3％的变压器参数要训练，因此在大多数数据集中进行了微调，并且在几个数据集上的微调（例如，WSC 1.1上的准确性提高了12.9％）。源代码可从https://github.com/genggui001/fl-tuning获得。

推断在时间知识图中的缺失的事实是一项关键任务，已被广泛探索。在时间推理任务中的外推更具挑战性，并且由于没有直接的历史事实来预测，逐渐引起研究人员的注意力。以前的作品试图申请进化的代表学习，以解决推断问题。然而，这些技术没有明确地利用各种时序感知属性表示，即，推理性能受到历史长度的显着影响。为了减轻推理未来缺失事实时的时间依赖，我们提出了一种记忆触发的决策（MTDM）网络，该网络包括瞬态记忆，长期记忆和深回忆。具体地，瞬态学习网络认为瞬态存储器作为静态知识图，并且时间感知的经常性演化网络通过长短期存储器的一系列经常性演化单元来学习表示。每个演化单元由结构编码器组成，以聚合边缘信息，具有用于更新实体的属性表示的Gating单元的时间编码器。 MTDM利用制备的残余多关系聚合器作为结构编码器来解决多跳覆盖问题。我们还介绍了更好地理解事件溶解过程的溶解学习限制。广泛的实验证明了MTDM减轻了历史依赖性并实现了最先进的预测性能。此外，与最先进的基线相比，MTDM显示了更快的收敛速度和训练速度。

The development of social media user stance detection and bot detection methods rely heavily on large-scale and high-quality benchmarks. However, in addition to low annotation quality, existing benchmarks generally have incomplete user relationships, suppressing graph-based account detection research. To address these issues, we propose a Multi-Relational Graph-Based Twitter Account Detection Benchmark (MGTAB), the first standardized graph-based benchmark for account detection. To our knowledge, MGTAB was built based on the largest original data in the field, with over 1.55 million users and 130 million tweets. MGTAB contains 10,199 expert-annotated users and 7 types of relationships, ensuring high-quality annotation and diversified relations. In MGTAB, we extracted the 20 user property features with the greatest information gain and user tweet features as the user features. In addition, we performed a thorough evaluation of MGTAB and other public datasets. Our experiments found that graph-based approaches are generally more effective than feature-based approaches and perform better when introducing multiple relations. By analyzing experiment results, we identify effective approaches for account detection and provide potential future research directions in this field. Our benchmark and standardized evaluation procedures are freely available at: https://github.com/GraphDetec/MGTAB.

Interview has been regarded as one of the most crucial step for recruitment. To fully prepare for the interview with the recruiters, job seekers usually practice with mock interviews between each other. However, such a mock interview with peers is generally far away from the real interview experience: the mock interviewers are not guaranteed to be professional and are not likely to behave like a real interviewer. Due to the rapid growth of online recruitment in recent years, recruiters tend to have online interviews, which makes it possible to collect real interview data from real interviewers. In this paper, we propose a novel application named EZInterviewer, which aims to learn from the online interview data and provides mock interview services to the job seekers. The task is challenging in two ways: (1) the interview data are now available but still of low-resource; (2) to generate meaningful and relevant interview dialogs requires thorough understanding of both resumes and job descriptions. To address the low-resource challenge, EZInterviewer is trained on a very small set of interview dialogs. The key idea is to reduce the number of parameters that rely on interview dialogs by disentangling the knowledge selector and dialog generator so that most parameters can be trained with ungrounded dialogs as well as the resume data that are not low-resource. Evaluation results on a real-world job interview dialog dataset indicate that we achieve promising results to generate mock interviews. With the help of EZInterviewer, we hope to make mock interview practice become easier for job seekers.

Dynamic treatment regimes assign personalized treatments to patients sequentially over time based on their baseline information and time-varying covariates. In mobile health applications, these covariates are typically collected at different frequencies over a long time horizon. In this paper, we propose a deep spectral Q-learning algorithm, which integrates principal component analysis (PCA) with deep Q-learning to handle the mixed frequency data. In theory, we prove that the mean return under the estimated optimal policy converges to that under the optimal one and establish its rate of convergence. The usefulness of our proposal is further illustrated via simulations and an application to a diabetes dataset.

Temporal sentence grounding (TSG) aims to identify the temporal boundary of a specific segment from an untrimmed video by a sentence query. All existing works first utilize a sparse sampling strategy to extract a fixed number of video frames and then conduct multi-modal interactions with query sentence for reasoning. However, we argue that these methods have overlooked two indispensable issues: 1) Boundary-bias: The annotated target segment generally refers to two specific frames as corresponding start and end timestamps. The video downsampling process may lose these two frames and take the adjacent irrelevant frames as new boundaries. 2) Reasoning-bias: Such incorrect new boundary frames also lead to the reasoning bias during frame-query interaction, reducing the generalization ability of model. To alleviate above limitations, in this paper, we propose a novel Siamese Sampling and Reasoning Network (SSRN) for TSG, which introduces a siamese sampling mechanism to generate additional contextual frames to enrich and refine the new boundaries. Specifically, a reasoning strategy is developed to learn the inter-relationship among these frames and generate soft labels on boundaries for more accurate frame-query reasoning. Such mechanism is also able to supplement the absent consecutive visual semantics to the sampled sparse frames for fine-grained activity understanding. Extensive experiments demonstrate the effectiveness of SSRN on three challenging datasets.

Human parsing aims to partition humans in image or video into multiple pixel-level semantic parts. In the last decade, it has gained significantly increased interest in the computer vision community and has been utilized in a broad range of practical applications, from security monitoring, to social media, to visual special effects, just to name a few. Although deep learning-based human parsing solutions have made remarkable achievements, many important concepts, existing challenges, and potential research directions are still confusing. In this survey, we comprehensively review three core sub-tasks: single human parsing, multiple human parsing, and video human parsing, by introducing their respective task settings, background concepts, relevant problems and applications, representative literature, and datasets. We also present quantitative performance comparisons of the reviewed methods on benchmark datasets. Additionally, to promote sustainable development of the community, we put forward a transformer-based human parsing framework, providing a high-performance baseline for follow-up research through universal, concise, and extensible solutions. Finally, we point out a set of under-investigated open issues in this field and suggest new directions for future study. We also provide a regularly updated project page, to continuously track recent developments in this fast-advancing field: https://github.com/soeaver/awesome-human-parsing.

A storyboard is a roadmap for video creation which consists of shot-by-shot images to visualize key plots in a text synopsis. Creating video storyboards however remains challenging which not only requires association between high-level texts and images, but also demands for long-term reasoning to make transitions smooth across shots. In this paper, we propose a new task called Text synopsis to Video Storyboard (TeViS) which aims to retrieve an ordered sequence of images to visualize the text synopsis. We construct a MovieNet-TeViS benchmark based on the public MovieNet dataset. It contains 10K text synopses each paired with keyframes that are manually selected from corresponding movies by considering both relevance and cinematic coherence. We also present an encoder-decoder baseline for the task. The model uses a pretrained vision-and-language model to improve high-level text-image matching. To improve coherence in long-term shots, we further propose to pre-train the decoder on large-scale movie frames without text. Experimental results demonstrate that our proposed model significantly outperforms other models to create text-relevant and coherent storyboards. Nevertheless, there is still a large gap compared to human performance suggesting room for promising future work.

In the new era of personalization, learning the heterogeneous treatment effect (HTE) becomes an inevitable trend with numerous applications. Yet, most existing HTE estimation methods focus on independently and identically distributed observations and cannot handle the non-stationarity and temporal dependency in the common panel data setting. The treatment evaluators developed for panel data, on the other hand, typically ignore the individualized information. To fill the gap, in this paper, we initialize the study of HTE estimation in panel data. Under different assumptions for HTE identifiability, we propose the corresponding heterogeneous one-side and two-side synthetic learner, namely H1SL and H2SL, by leveraging the state-of-the-art HTE estimator for non-panel data and generalizing the synthetic control method that allows flexible data generating process. We establish the convergence rates of the proposed estimators. The superior performance of the proposed methods over existing ones is demonstrated by extensive numerical studies.